Data Analysis and Mining in Ordered Information Tables

Many real world problems deal with ordering objects instead of classifying objects, although majority of research in machine learning and data mining has been focused on the latter. For modeling ordering problems, we generalize the notion of information tables to ordered information tables by adding order relations on attribute values. The problem of mining ordering rules is formulated as finding association between orderings of attribute values and the overall ordering of objects. An ordering rules may state that “if the value of an object x on an attribute a is ordered ahead of the value of another object y on the same attribute, then x is ordered ahead of y”. For mining ordering rules, we first transform an ordered information table into a binary information, and then apply any standard machine learning and data mining algorithms. As an illustration, we analyze in detail Maclean’s universities ranking for the year 2000.